Representations of Graphs by Means of Products and Their Complexity
نویسنده
چکیده
I. A graph G is a pair (V,E) where V is a finite set and E is either a set of ordered pairs from V (i.e. E ~V × V) or a set of unordered pairs from V (i.e. E ~ [V3 2 ) . In the former case G is called an oriented graph in the latter an unoriented graph . Elements of the set E are called edges. An edge e g E is indicated by [x,y] = e where the bracketing means consistently in the whole formula either (x,y) (an arrow an ordered edge) or ~x,y} Ca link an unordered edge) .
منابع مشابه
A Critical Discourse Analysis of the Representations of Females in Printed Advertisements (Case study of Payame Yaghoot Medical health Iranian Journal)
AbstractPrint advertisements not only directly try to persuade buyers but also indirectly play a role in shaping their social attitude. An interesting area of research that as yet has received little or no attention is the study of the representations of females in magazines that their readers are mostly women. This study examined print advertisements in local family and health magazine from a ...
متن کاملIrreducibility of the tensor product of Albeverio's representations of the Braid groups $B_3$ and $B_4$
We consider Albeverio's linear representations of the braid groups $B_3$ and $B_4$. We specialize the indeterminates used in defining these representations to non zero complex numbers. We then consider the tensor products of the representations of $B_3$ and the tensor products of those of $B_4$. We then determine necessary and sufficient conditions that guarantee the irreducibility of th...
متن کاملMental Representations of Lyrical Prose
The article analyzes mental representations of Russian lyrical prose texts. The texts demonstrate collective memory engrams that are defined by cultural and historical legacy of the nation and authors’ creative world perception. In architectonics of a lyrical prose text, sense perception reveals itself in accumulated underlying meanings and wisdom conveyed by expressive means. The author’s inte...
متن کاملA study on some properties of leap graphs
In a graph G, the first and second degrees of a vertex v is equal to thenumber of their first and second neighbors and are denoted by d(v/G) andd 2 (v/G), respectively. The first, second and third leap Zagreb indices are thesum of squares of second degrees of vertices of G, the sum of products of second degrees of pairs of adjacent vertices in G and the sum of products of firs...
متن کاملOn Symmetry of Some Nano Structures
It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1981